Improved small-set expansion from higher eigenvalues
نویسندگان
چکیده
Consider an irreducible reversible Markov chain on state space V , with |V | = n and invariant distribution π. Let 0 = λ1 ≤ λ2 ≤ · · ·λn ≤ 2 be the eigenvalues of its Laplacian operator. We give a simple spectral condition under which there exists a unit vector f ∈ L(V, π) with ‖f‖1 ≤ δ and 〈f, Lf〉 ≤ . (Using a standard Cheeger inequality, this implies the existence of a set S ⊆ V with measure at most O(δ) and expansion at most O( √ ).) As a consequence we show that for any k ∈ [n] and small α > 0, there is always a set S ⊆ V with measure at most O(k−1+α) and expansion at most √ λk logk n ·O(α−1/2). This essentially resolves a question of Arora, Barak, and Steurer, who obtained the same result with O(k−1/100) in place of O(k−1+α).
منابع مشابه
INVESTIGATING THE LINEAR EXPANSION, SET, AND STRENGTH BEHAVIORS OF THE BINARY MIXTURE PORTLAND CEMENT CLINKER-GYPSUM
Abstract: The linear expansion, early-age compressive strength and setting times of the binary mixtures of gypsum and Portland cement clinkers of relatively low C3A-contents were investigated. For this reason, type 1, 2, and 5 of Portland cement-clinkers were selected and a number of binary mixtures were designed. At relatively lower percentages of gypsum (about 5%), the early strength behavior...
متن کاملMarkov chain methods for small-set expansion
Consider a finite irreducible Markov chain with invariant distribution π. We use the inner product induced by π and the associated heat operator to simplify and generalize some results related to graph partitioning and the small-set expansion problem. For example, Steurer showed a tight connection between the number of small eigenvalues of a graph’s Laplacian and the expansion of small sets in ...
متن کاملLasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. This framework includes well known graph problems such as Minimum graph bisection, Edge expansion, Uniform sparsest cut, and Small Set expansion, as well as the Unique Games problem. These problems are notorious for the ex...
متن کاملOn Non-Optimally Expanding Sets in Grassmann Graphs
The paper investigates expansion properties of the Grassmann graph, motivated by recent results of [KMS16, DKK16] concerning hardness of the Vertex-Cover and of the 2-to-1 Games problems. Proving the hypotheses put forward by these papers seems to first require a better understanding of these expansion properties. We consider the edge expansion of small sets, which is the probability of choosin...
متن کاملLocalization of Eigenvalues in Small Specified Regions of Complex Plane by State Feedback Matrix
This paper is concerned with the problem of designing discrete-time control systems with closed-loop eigenvalues in a prescribed region of stability. First, we obtain a state feedback matrix which assigns all the eigenvalues to zero, and then by elementary similarity operations we find a state feedback which assigns the eigenvalues inside a circle with center and radius. This new algorithm ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1204.4688 شماره
صفحات -
تاریخ انتشار 2012